package com.xiaoh.leetcode.easy;

/**
 * @author xiaoh
 * @ClassName Solution_219
 * @Description TODO
 * @Date 2021/9/23 下午5:42
 * @Version 1.0
 */
public class Solution_219 {

    public static boolean containsNearbyDuplicate(int[] nums, int k) {
        boolean flag = false;
        if (nums.length <= 1) {
            return flag;
        }
        
        return flag;
    }

    public static void main(String[] args) {
        // true
        //int[] nums = new int[]{1,2,3,1};
        //int k = 3;

        // true
        //int[] nums = new int[]{1,0,1,1};
        //int k = 1;

        // false
        int[] nums = new int[]{1,2,3,1,2,3};
        int k = 2;
        boolean result = containsNearbyDuplicate(nums, k);
        System.out.println(result);
    }
}
